Genome-scale reconstructions of the mammalian secretory pathway predict metabolic costs and limitations of protein secretion

In mammalian cells, >25% of synthesized proteins are exported through the secretory pathway. The pathway complexity, however, obfuscates its impact on the secretion of different proteins. Unraveling its impact on diverse proteins is particularly important for biopharmaceutical production. Here we delineate the core secretory pathway functions and integrate them with genome-scale metabolic reconstructions of human, mouse, and Chinese hamster ovary\ua0cells. The resulting reconstructions enable the computation of energetic costs and machinery demands of each secreted protein. By integrating additional omics data, we find that highly secretory cells have adapted to reduce expression and secretion of other expensive host cell proteins. Furthermore, we predict metabolic costs and maximum productivities of biotherapeutic proteins and identify protein features that most significantly impact protein secretion. Finally, the model successfully predicts the increase in secretion of a monoclonal antibody after silencing a highly expressed selection marker. This work represents a knowledgebase of the mammalian secretory pathway that serves as a novel tool for systems biotechnology

Tumour subregion analysis of colorectal liver metastases using semi-automated clustering based on DCE-MRI: Comparison with histological subregions and impact on pharmacokinetic parameter analysis.

PURPOSE: To use a novel segmentation methodology based on dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) to define tumour subregions of liver metastases from colorectal cancer (CRC), to compare these with histology, and to use these to compare extracted pharmacokinetic (PK) parameters between tumour subregions. MATERIALS AND METHODS: This ethically-approved prospective study recruited patients with CRC and ≥1 hepatic metastases scheduled for hepatic resection. Patients underwent DCE-MRI pre-metastasectomy. Histological sections of resection specimens were spatially matched to DCE-MRI acquisitions and used to define histological subregions of viable and non-viable tumour. A semi-automated voxel-wise image segmentation algorithm based on the DCE-MRI contrast-uptake curves was used to define imaging subregions of viable and non-viable tumour. Overlap of histologically-defined and imaging subregions was compared using the Dice similarity coefficient (DSC). DCE-MRI PK parameters were compared for the whole tumour and histology-defined and imaging-derived subregions. RESULTS: Fourteen patients were included in the analysis. Direct histological comparison with imaging was possible in nine patients. Mean DSC for viable tumour subregions defined by imaging and histology was 0.738 (range 0.540-0.930). There were significant differences between Ktrans and kep for viable and non-viable subregions (p < 0.001) and between whole lesions and viable subregions (p < 0.001). CONCLUSION: We demonstrate good concordance of viable tumour segmentation based on pre-operative DCE-MRI with a post-operative histological gold-standard. This can be used to extract viable tumour-specific values from quantitative image analysis, and could improve treatment response assessment in clinical practice

A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows

In this paper, a Mixed-Shift Vehicle Routing Problem is proposed based on a real-life container transportation problem. In a long planning horizon of multiple shifts, transport tasks are completed satisfying the time constraints. Due to the different travel distances and time of tasks, there are two types of shifts (long shift and short shift) in this problem. The unit driver cost for long shifts is higher than that of short shifts. A mathematical model of this Mixed-Shift Vehicle Routing Problem with Time Windows (MS-VRPTW) is established in this paper, with two objectives of minimizing the total driver payment and the total travel distance. Due to the large scale and nonlinear constraints, the exact search showed is not suitable to MS-VRPTW. An initial solution construction heuristic (EBIH) and a selective perturbation Hyper-Heuristic (GIHH) are thus developed. In GIHH, five heuristics with different extents of perturbation at the low level are adaptively selected by a high level selection scheme with the Hill Climbing acceptance criterion. Two guidance indicators are devised at the high level to adaptively adjust the selection of the low level heuristics for this bi-objective problem. The two indicators estimate the objective value improvement and the improvement direction over the Pareto Front, respectively. To evaluate the generality of the proposed algorithms, a set of benchmark instances with various features is extracted from real-life historical datasets. The experiment results show that GIHH significantly improves the quality of the final Pareto Solution Set, outperforming the state-of-the-art algorithms for similar problems. Its application on VRPTW also obtains promising results

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographical positions have been used, located in the province of Bizkaia, Spain. For the proper treatment of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed. This application is the first application of the firefly algorithm to any rich vehicle routing problem. To prove that the proposed DFA is a promising technique, its performance has been compared with two other well-known techniques: an evolutionary algorithm and an evolutionary simulated annealing. Our results have shown that the DFA has outperformed these two classic meta-heuristics

Characterization and mitigation of gene expression burden in mammalian cells

Despite recent advances in circuit engineering, the design of genetic networks in mammalian cells is still painstakingly slow and fraught with inexplicable failures. Here, we demonstrate that transiently expressed genes in mammalian cells compete for limited transcriptional and translational resources. This competition results in the coupling of otherwise independent exogenous and endogenous genes, creating a divergence between intended and actual function. Guided by a resource-aware mathematical model, we identify and engineer natural and synthetic miRNA-based incoherent feedforward loop (iFFL) circuits that mitigate gene expression burden. The implementation of these circuits features the use of endogenous miRNAs as elementary components of the engineered iFFL device, a versatile hybrid design that allows burden mitigation to be achieved across different cell-lines with minimal resource requirements. This study establishes the foundations for context-aware prediction and improvement of in vivo synthetic circuit performance, paving the way towards more rational synthetic construct design in mammalian cells